What You Always Wanted to Know About Rigid E-Uni cation

نویسنده

  • Anatoli Degtyarev
چکیده

This paper solves an open problem posed by a number of researchers: the construction of a complete calculus for matrix-based methods with rigid E-uniication. The use of rigid E-uniication and simultaneous rigid E-uniication for such methods has been proposed in (Gallier et al., 1987). After our proof of the undecidability of simultaneous rigid E-uniication (Degtyarev and Voronkov, 1996e) it has become clear that one should look for more reened techniques to deal with equality in matrix-based methods. In this article, we deene a complete proof procedure for rst-order logic with equality based on an incomplete but terminating procedure for rigid E-uniication. Our approach is applicable to the connection method and the tableau method and illustrated on the tableau method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monadic Simultaneous Rigid E-Uni cation and Related Problems

We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.

متن کامل

Presenting a Hybrid Approach based on Two-stage Data Envelopment Analysis to Evaluating Organization Productivity

   Measuring the performance of a production system has been an important task in management for purposes of control, planning, etc. Lord Kelvin said :“When you can measure what you are speaking about, and express it in numbers, you know something about it; but when you cannot measure it, when you cannot express it in numbers, your knowledge is of a meager and unsatisfactory kind.” Hence, manag...

متن کامل

Monadic Simultaneous Rigid E-Unification and Related Problems

We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem. 1 Section

متن کامل

Everything You Always Wanted to Know about Tocharian*

INTRODUCTION Tocharian is an extinct Indo-European language which stands by itself as one of the eleven major groups in the IE language family. It was not discovered until the turn of this century, as a result of archaeological expeditions to Chinese Turkestan. What are some of the characteristics of Tocharian and what impact has it made on our knowledge of IE languages in general? This paper s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996